Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
For many years globally convergent probability-one homotopy methods have been remarkably successful on difficult realistic engineering optimization problems, most of which were attacked by homotopy methods because other optimization algorithms failed or were ineffective. Convergence theory has been derived for a few particular problems, and considerable fixed point theory exists, but generally ...
متن کاملA globally convergent QP-free algorithm for nonlinear semidefinite programming
In this paper, we present a QP-free algorithm for nonlinear semidefinite programming. At each iteration, the search direction is yielded by solving two systems of linear equations with the same coefficient matrix; [Formula: see text] penalty function is used as merit function for line search, the step size is determined by Armijo type inexact line search. The global convergence of the proposed ...
متن کاملProbability-one homotopies in computational science
Probability-one homotopy algorithms are a class of methods for solving nonlinear systems of equations that, under mild assumptions, are globally convergent for a wide range of problems in science and engineering. Convergence theory, robust numerical algorithms, and production quality mathematical software exist for general nonlinear systems of equations, and special cases such as Brouwer fixed ...
متن کاملA Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints
A solution of the standard formulation of a linear program with linear complementarity constraints (LPCC) does not satisfy a constraint qualification. A family of relaxations of an LPCC, associated with a probability-one homotopy map, proposed here is shown to have several desirable properties. The homotopy map is nonlinear, replacing all the constraints with nonlinear relaxations of NCP functi...
متن کاملA globally convergent primal-dual interior-point three-dimensional filter method for nonlinear semidefinite programming
This paper proposes a primal-dual interior-point filter method for nonlinear semidefinite programming, which is the first multidimensional (three-dimensional) filter methods for interior-point methods, and of course for constrained optimization. A freshly new definition of filter entries is proposed, which is greatly different from those in all the current filter methods. A mixed norm is used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2001
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s105262349936121x